Hamilton cycles in 5-connected line graphs
نویسندگان
چکیده
A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at least 6 is hamiltonian. The result extends to claw-free graphs and to Hamilton-connectedness.
منابع مشابه
On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
The topological approach to the study of infinite graphs of Diestel and K ̈hn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4-edge-connected graph is hamiltonian. We prove a weaker version of this result for infinite graphs: The line graph of locally finite, 6-edge-connected graph w...
متن کاملHamilton cycles and paths in vertex-transitive graphs - Current directions
In this article current directions in solving Lovász’s problem about the existence of Hamilton cycles and paths in connected vertex-transitive graphs are given. © 2009 Elsevier B.V. All rights reserved. 1. Historical motivation In 1969, Lovász [59] asked whether every finite connected vertex-transitive graph has a Hamilton path, that is, a simple path going through all vertices, thus tying toge...
متن کاملA Closure for 1-Hamilton-Connectedness in Claw-Free Graphs
A graph G is 1-Hamilton-connected if G − x is Hamilton-connected for every vertex x ∈ V (G). In the paper we introduce a closure concept for 1-Hamiltonconnectedness in claw-free graphs. If G is a (new) closure of a claw-free graph G, then G is 1-Hamilton-connected if and only if G is 1-Hamilton-connected, G is the line graph of a multigraph, and for some x ∈ V (G), G − x is the line graph of a ...
متن کاملExtending Cycles Locally to Hamilton Cycles
A Hamilton circle in an infinite graph is a homeomorphic copy of the unit circle S1 that contains all vertices and all ends precisely once. We prove that every connected, locally connected, locally finite, claw-free graph has such a Hamilton circle, extending a result of Oberly and Sumner to infinite graphs. Furthermore, we show that such graphs are Hamilton-connected if and only if they are 3-...
متن کاملHeuristic search for Hamilton cycles in cubic graphs
A successful heuristic algorithm for nding Hamilton cycles in cubic graphs is described Several graphs from The Foster census of connected symmetric trivalent graphs and all cubic Cayley graphs of the group PSL are shown to be hamiltonian Proposed running head HAMILTON CYCLES IN CUBIC GRAPHS
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 33 شماره
صفحات -
تاریخ انتشار 2012